The Bethe Permanent of a Non - Negative Matrix ∗ Pascal
نویسنده
چکیده
It has recently been observed that the permanent of a non-negative matrix, i.e., of a matrix containing only nonnegative real entries, can very well be approximated by solving a certain Bethe free energy minimization problem with the help of the sum-product algorithm. We call the resulting approximation of the permanent the Bethe permanent. In this paper we give reasons why this approach to approximating the permanent works well. Namely, we show that the Bethe free energy is a convex function and that the sumproduct algorithm finds its minimum efficiently. We also show that the permanent is lower bounded by the Bethe permanent, and we list some empirical evidence that the permanent is upper bounded by some constant (that modestly grows with the matrix size) times the Bethe permanent. Part of these results are obtained by a combinatorial characterization of the Bethe permanent in terms of permanents of so-called lifted versions of the matrix under consideration. We conclude the paper with some conjectures about permanent-based pseudo-codewords and permanent-based kernels, and we comment on possibilities to modify the Bethe permanent so that it approximates the permanent even better.
منابع مشابه
On the spectra of reduced distance matrix of the generalized Bethe trees
Let G be a simple connected graph and {v_1,v_2,..., v_k} be the set of pendent (vertices of degree one) vertices of G. The reduced distance matrix of G is a square matrix whose (i,j)-entry is the topological distance between v_i and v_j of G. In this paper, we compute the spectrum of the reduced distance matrix of the generalized Bethe trees.
متن کاملBelief Propagation and Loop Calculus for Permanent of a Non-Negative Matrix
We consider computation of permanent of a positive (N × N) nonnegative matrix, P = (P j i |i, j = 1, · · · , N), or equivalently the problem of weighted counting of the perfect matchings over the complete bipartite graph KN,N . The problem is known to be of likely exponential complexity. Stated as the partition function Z of a graphical model, the problem allows exact Loop Calculus representati...
متن کاملBounding the Bethe and the Degree-M Bethe Permanents
In [1], it was conjectured that the permanent of a P-lifting θ of a matrix θ of degree M is less than or equal to the M th power of the permanent perm(θ), i.e., perm(θ) 6 perm(θ) and, consequently, that the degree-M Bethe permanent permM,B(θ) of a matrix θ is less than or equal to the permanent perm(θ) of θ, i.e., permM,B(θ) 6 perm(θ). In this paper, we prove these related conjectures and show ...
متن کاملRiordan group approaches in matrix factorizations
In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.
متن کاملApproximating the Permanent with Belief Propagation
This work describes a method of approximating matrix permanents efficiently using belief propagation. We formulate a probability distribution whose partition function is exactly the permanent, then use Bethe free energy to approximate this partition function. After deriving some speedups to standard belief propagation, the resulting algorithm requires O(n) time per iteration and seems empirical...
متن کامل